基于智慧校园建设推进军队院校教育现代化路径探究

教育信息化是教育现代化的基本内涵和显著特征。当前,我国正处于由基本实现教育现代化迈向整体实现教育现代化的重要战略期,国家教育从理论和实践层面进行了大量探索。在军队院校教育领域,教育技术应用、训练管理领域网络建设、数字校园建设等均为军队院校教育现代化奠定了创新发展基础,智能教育应用模式的改革探索也为军队院校教育现代化描绘了未来建设愿景。本文认为,推进军队院校教育现代化应发挥智慧校园建设平台的基础作用,充分融入国家教育体系,注重以先进教育理念驱动创新发展、以前沿信息技术提供解决方案、以总体架构设计规范目标功能、以智慧育人环境承载应用服务、以数据资源体系孕育智慧生态,走开军委军种院校三级联动推动创新发展的路子。     

面向图计算应用的处理器访存通路优化设计与实现

针对图计算应用的访存特点,提出并实现一种支持高并发、乱序和异步访存的高并发访存模块(High Concurrency and high Performance Fetcher, HCPF)。通过软-硬件协同的设计方法,HCPF可同时处理192条共8种类型的内存访问请求,且访存粒度可由用户定义,满足图计算应用对海量低延迟细粒度数据访问的需求。同时,HCPF扩展了基于内存语义的跨计算节点定制互连技术,支持远程内存的细粒度直接访问,为后续实现分布式图计算框架提供技术基础。结合上述两个核心研究内容,基于流水线RISC-V处理器核,设计并实现了可支持HCPF的RISC-V片上系统(System-on-Chip,SoC)架构,搭建基于FPGA的原型验证平台,并使用自研测试程序对HCPF进行初步性能评测。实验结果表明,HCPF相比原有访存通路,最高可将基于数组和随机地址的两种随机内存访问性能分别提升至3.5倍和2.7倍。远程内存直接访问4 Byte数据的延时仅为1.63μs。     

无人机避障航路规划方法研究综述

随着无人机作业空域从中高空不断向低空甚至超低空拓展,复杂的低空障碍环境对无人机造成了严重的威胁。研究无人机避障航路规划理论与方法,对于保障无人机的飞行安全和提升其任务效率具有重要作用。对无人机避障航路规划方法的研究现状进行了梳理,首先,根据航路规划问题所建立的优化模型,将规划方法划分为基于数学规划的方法、基于路标图的方法、基于空间分解的方法、基于势场的方法、基于随机规划的方法和基于机器学习的方法六个大类。然后,分别介绍了各类型方法的基本原理、代表性研究以及优缺点。最后,对避障航路规划方法未来可能的研究方向进行了展望。综述表明,复杂环境下无人机三维航路规划方法的研究仍有提升空间;未来应考虑将传统规划方法与新一代人工智能技术相结合;航路规划方法研究应充分考虑机载传感器的实际性能和工作特性;规划航路的可跟踪性问题也亟待解决。     

Path planning for moving target tracking by fixed-wing UAV

For the automatic tracking of unknown moving targets on the ground, most of the commonly used methods involve circling above the target. With such a tracking mode, there is a moving laser spot on the target, which will bring trouble for cooperative manned helicopters. In this paper, we propose a new way of tracking, where an unmanned aerial vehicle (UAV) circles on one side of the tracked target. A circular path algorithm is developed for monitoring the relative position between the UAV and the target considering the real-time range and the bearing angle. This can determine the center of the new circular path if the predicted range between the UAV and the target does not meet the monitoring requirements. A transition path algorithm is presented for planning the transition path between circular paths that constrain the turning radius of the UAV. The transition path algorithm can generate waypoints that meet the flight ability. In this paper, we analyze the entire method and detail the scope of applications. We formulate an observation angle as an evaluation index. A series of simulations and evaluation index comparisons verify the effectiveness of the proposed algorithms.     

An eikonal equation based path planning method using polygon decomposition and curve evolution

Path planning is a key technique of autonomous navigation for robots, and the velocity field is an important part. Constructing velocity field in a complex workspace is still challenging. In this paper, an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper. The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace, and the velocity field is obtained by utilizing the potential field of this workspace. Path optimization is implemented by curve evolution, during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field. The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness. Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.